NP - completeness Results for NONOGRAM

Dynamic Inertia Weight Particle Swarm Optimization for Solving Nonogram Puzzles

Particle swarm optimization (PSO) has shown to be a robust and efficient optimization algorithm therefore PSO has received increased attention in many research fields. This paper demonstrates the feasibility of applying the Dynamic Inertia Weight Particle Swarm Optimization to solve a Non-Polynomial (NP) Complete puzzle. This paper presents a new approach to solve the Nonograms Puzzle using Dyn...

Solving Nonograms by combining relaxations

Nonograms, also known as Japanese puzzles, are a specific type of logic drawing puzzles. The challenge is to fill a grid with black and white pixels in such a way that a given description for each row and column, indicating the lengths of consecutive segments of black pixels, is adhered to. Although the Nonograms in puzzle books can usually be solved by hand, the general problem of solving Nono...

Constructing Simple Nonograms of Varying Difficulty

Japanese puzzles, also known as Nonograms, are image reconstruction problems that can be solved by logic reasoning. Nonograms can have widely varying difficulty levels. Although the general Nonogram problem is NP-hard, the instances that occur in puzzle collections can usually be solved by hand. This paper focuses on a subclass of Nonograms that can be solved by a sequence of local reasoning st...

Some New Results for k - Dense Trees : NP - Completeness TheoryGianni

On the NP-Completeness of the Minimum Circuit Size Problem

We study the Minimum Circuit Size Problem (MCSP): given the truth-table of a Boolean function f and a number k, does there exist a Boolean circuit of size at most k computing f? This is a fundamental NP problem that is not known to be NP-complete. Previous work has studied consequences of the NP-completeness of MCSP. We extend this work and consider whether MCSP may be complete for NP under mor...